Distance Sets of Well-Distributed Planar Point Sets
نویسندگان
چکیده
منابع مشابه
Distance Sets of Well-Distributed Planar Point Sets
We prove that a well-distributed subset of R2 can have a distance set ∆ with #(∆ ∩ [0, N ]) ≤ CN3/2− only if the distance is induced by a polygon K. Furthermore, if the above estimate holds with = 1/2, then K can have only finitely many sides.
متن کاملDistance Sets of Well-distributed Planar Sets for Polygonal Norms
Let X be a 2-dimensional normed space, and let BX be the unit ball in X. We discuss the question of how large the set of extremal points of BX may be if X contains a well-distributed set whose distance set ∆ satisfies the estimate |∆ ∩ [0, N ]| ≤ CN3/2− . We also give a necessary and sufficient condition for the existence of a well-distributed set with |∆ ∩ [0, N ]| ≤ CN .
متن کاملOn distance measures for well-distributed sets
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been classically used to study this problem. We conjecture that a majorant for the spherical means suffices to prove the distance conjecture(s) in this setting. For a ...
متن کاملk-Sets of Convex Inclusion Chains of Planar Point Sets
Given a set V of n points in the plane, we introduce a new number of k-sets that is an invariant of V : the number of k-sets of a convex inclusion chain of V . A convex inclusion chain of V is an ordering (v1, v2, ..., vn) of the points of V such that no point of the ordering belongs to the convex hull of its predecessors. The k-sets of such a chain are then the distinct k-sets of all the subse...
متن کاملInequalities on Well-distributed Point Sets on Circles
The setting is a finite set P of points on the circumference of a circle, where all points are assigned non-negative real weights w(p). Let Pi be all subsets of P with i points and no two distinct points within a fixed distance d. We prove that W 2 k ≥ Wk+1Wk−1 where Wk = ∑ A∈Pi ∏ p∈A w(p). This is done by first extending a theorem by Chudnovsky and Seymour on roots of stable set polynomials of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2857-1